Approximation of boolean functions by combinatorial rectangles
نویسندگان
چکیده
منابع مشابه
Approximation of Boolean Functions
This paper deals with the number of monochromatic combinatorial rectangles required to approximate a Boolean function on a constant fraction of all inputs, where each rectangle may be defined with respect to its own partition of the input variables. The main result of the paper is that the number of rectangles required for the approximation of Boolean functions in this model is very sensitive t...
متن کاملAPPROXIMATION OF 3D-PARAMETRIC FUNCTIONS BY BICUBIC B-SPLINE FUNCTIONS
In this paper we propose a method to approximate a parametric 3 D-function by bicubic B-spline functions
متن کاملApproximation of non-Boolean functions by Boolean functions and applications in non-standard computing
Abstract We survey the research and we report new results related to the relationships that exist between Boolean and nonBoolean functions defined on Boolean algebras. The results included here are relevant for set-valued logic that is useful in several non-standard types of circuits: interconnectionfree biomolecular devices, devices based on optical wavelength multiplexing, etc. We extend our ...
متن کاملCombinatorial method for Boolean SAC functions designing
In this paper a new approach for designing Boolean functions that satisfy the Strict Avalanche Criterion (SAC) is presented. The advantage of the suggested approach is the simplicity of its realization and the significant greater number of the generated functions compared to the known methods. The formalized procedure for construction of nonbalanced and balanced SAC-functions is described in de...
متن کاملApproximation Properties of Positive Boolean Functions
The universal approximation property is an important characteristic of models employed in the solution of machine learning problems. The possibility of approximating within a desired precision any Borel measurable function guarantees the generality of the considered approach. The properties of the class of positive Boolean functions, realizable by digital circuits containing only and and or por...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00568-6